Incidence graphs constructed from t-designs
نویسندگان
چکیده
Let D be a non-trivial simple t-design. For 1 ≤ s ≤ t, we generalize the concept of the incidence graph of D and construct a new bipartite regular graph Γ. We obtain that the edge-transitivity of the graph Γ is equivalent to the s-flag-transitivity of the design D. We then, for s = 2, classify the semisymmetric graphs among the graphs Γ constructed from biplanes and triplanes. Finally, we study the connectedness and the energy of incidence graphs. Several open problems are proposed, one of which asks whether the incidence graphs have large vertex-connectivity.
منابع مشابه
TRANSITIVE t - DESIGNS AND STRONGLY REGULAR GRAPHS CONSTRUCTED FROM LINEAR GROUPS L ( 2 , q ) , q ≤ 23
In this paper we construct transitive t-designs from the linear groups L(2, q), q ≤ 23. Thereby we classify t-designs, t ≥ 2, admitting a transitive action of the linear groups L(2, q), q ≤ 23, up to 35 points and obtained numerous transitive designs, for 36 ≤ v ≤ 55. In many cases we proved the existence of t-designs with certain parameter sets. Among others we constructed t-designs with param...
متن کاملOn Some Combinatorial Structures Constructed from the Groups L 3 , 5 , U 5 , 2 , and S 6 , 2 Dean
We describe a construction of primitive 2-designs and strongly regular graphs from the simple groups L 3, 5 , U 5, 2 , and S 6, 2 . The designs and the graphs are constructed by defining incidence structures on conjugacy classes of maximal subgroups of L 3, 5 , U 5, 2 , and S 6, 2 . In addition, from the group S 6, 2 , we construct 2-designs with parameters 28, 4, 4 and 28, 4, 1 having the full...
متن کاملHigh-rate LDPC codes from unital designs
This paper presents a construction of very high-rate low-density parity-check (LDPC) codes based on the incidence matrices of unital designs. Like the projective geometry and oval designs, unital designs exist with incidence matrices which are significantly rank deficient. Thus high-rate LDPC codes with a large number of linearly dependent parity-check equations can be constructed. The LDPC cod...
متن کاملRegular low-density parity-check codes from oval designs
This paper presents a construction of low-density parity-check (LDPC) codes based on the incidence matrices of oval designs. The new LDPC codes have regular parity-check matrices and Tanner graphs free of 4-cycles. Like the finite geometry codes, the codes from oval designs have parity-check matrices with a large proportion of linearly dependent rows and can achieve significantly better minimum...
متن کاملSome Optimal Codes From Designs
The binary and ternary codes spanned by the rows of the point by block incidence matrices of some 2-designs and their complementary and orthogonal designs are studied. A new method is also introduced to study optimal codes.
متن کامل